Distributed Systems seminar: Shortest-path problem continuation
نویسندگان
چکیده
In graph theory, the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum of the weights of its edges is minimized. In last semester's report "Distributed Systems seminar: Shortest-path problem[1]" the previously created program was introduced that was able to perform shortest path search using A* algorithm on OpenStreetmap data. There were many areas for improvement in the previous program. This report contains the numerous improvements and changes made to the program.
منابع مشابه
Cockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملSAT Techniques for Lexicographic Path Orders
This report was written for the seminar Computational Logic 3 conducted at the Institute of Computer Science of the University of Innsbruck. It is concerned with a SAT solver approach for deciding LPO-termination of term rewrite systems and a continuation of the seminar report [13] which considers a BDD approach. After relevant algorithms are explained, experimental results are reported.
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملPoint-of-Failure Swap Rerouting: Computing The Optimal Swaps Distributively
We consider the problem of computing the optimal swap edges of a shortest-path tree. This problem arises in designing systems that offer point-of-failure shortest-path rerouting service in presence of a single link failure: if the shortest path is not affected by the failed link, then the message will be delivered through that path; otherwise, the system will guarantee that, when the message re...
متن کاملEfficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path rerouting service in presence of a single link failure: if the shortest path is not affected by the failed link, then the message will be delivered through that path; otherwise, the system will guarantee that, when t...
متن کامل